Fixed Parameter Tractable Reasoning in DLs via Decomposition
نویسندگان
چکیده
منابع مشابه
Consequence-based and fixed-parameter tractable reasoning in description logics
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for subsumption reasoning with description logic ontologies, presenting the following novel results. First, we present a very general consequence-based reasoning algorithm that can be instantiated so as to capture the essential features of the known algorithms. Second, we use this algorithm to develop ...
متن کاملSoundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractable DLs are restricted in terms of expressive power. This brings a new challenge: can users use expressive DLs to build their ontologies and still enjoy the efficient services as in tractable languages. In this paper, w...
متن کاملTractable Reasoning Based on the Fuzzy EL++ Algorithm
Fuzzy Description Logics (f-DLs) are extensions of classic DLs that are capable of representing and reasoning about imprecise and vague knowledge. Though reasoning algorithms for very expressive fuzzy DLs have been explored, an open issue in the fuzzy DL community is the study of tractable systems. In this paper we introduce the fuzzy extension of EL, we provide its syntax and semantics togethe...
متن کاملTractable approximate deduction for OWL
Today’s ontology applications require efficient and reliable description logic (DL) reasoning services. Expressive DLs usually have high worst case complexity while tractable DLs are restricted in terms of expressive power. This brings a new challenge: can users use expressive DLs to build their ontologies and still enjoy the efficient services as in tractable languages? Approximation has been ...
متن کاملClassifying Fuzzy Subsumption in Fuzzy-EL+
Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extensions to expressive DLs have been proposed today and many reasoning algorithms exist there is still no scalable and efficient reasoning system reported, mainly due to inherited computational complexity from crisp DLs and the lack f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011